Shannon's sampling theorem in a distributional setting
نویسنده
چکیده
The classical Shannon sampling theorem states that a signal f with Fourier transform F ∈ L(R) having its support contained in (−π, π) can be recovered from the sequence of samples (f(n))n∈Z via f(t) = ∑ n∈Z f(n) sin(π(t− n)) π(t− n) (t ∈ R). In this article we prove a generalization of this result under the assumption that F ∈ E (R) has support contained in (−π, π).
منابع مشابه
The distributional Henstock-Kurzweil integral and measure differential equations
In the present paper, measure differential equations involving the distributional Henstock-Kurzweil integral are investigated. Theorems on the existence and structure of the set of solutions are established by using Schauder$^prime s$ fixed point theorem and Vidossich theorem. Two examples of the main results paper are presented. The new results are generalizations of some previous results in t...
متن کاملDynamics of Pseudo Radioactive Chemical Products via Sampling Theory
The decomposition of radioactive chemical products usually follows an exponential dynamics. The present paper deals with the problem of analyzing the unknown dynamics of pseudo radioactive materials for which we have a temporal sample of the amount of the decomposing product. The strategy for studying if the adjustment of the dynamics is or not of exponential type is to use a recent generalizat...
متن کاملAutomatic Detection of the Common and Non-common Frequencies in Congruent Discrete Spectra. A Theoretical Approach
Both sampling a time-varying signal, and its spectral analysis are activities subjected to theoretically compelling, such as Shannon's theorem and the objectively limiting of the frequency’s resolution. Usually, the signals’ spectra are processed and interpreted by a scientist who, presumably, has sufficient prior information about the monitored signals to conclude on the significant frequencie...
متن کاملDistributional Importance Sampling for Approximate Weighted Model Counting
We present a sampling method to approximate the weighted model count of Boolean satisfiability problems. Our method is based on distributional importance sampling, where a subset of the variables are randomly set according to a backtrack-free distribution, and the remaining sub-formula is counted exactly. By using distributional samples (also known as Rao-Blackwellised samples), we can improve ...
متن کاملThe VLSI complexity of Boolean functions
It is well-known that all Boolean functions of n variables can be computed by a logic circuit with o(2n/n) gates (Lupanov's theorem) and that there exist Boolean functions of n variables which require logic circuits of this size (Shannon's theorem). We present corresponding results for Boolean functions computed by VLSI circuits, using Thompson's model of a VLSI chip. We prove that all Boolean ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1208.6493 شماره
صفحات -
تاریخ انتشار 2012